Efficiency of scale-free networks: error and attack tolerance
نویسندگان
چکیده
منابع مشابه
Efficiency of Scale-Free Networks: Error and Attack Tolerance
The concept of network efficiency, recently proposed to characterize the properties of small-world networks, is here used to study the effects of errors and attacks on scale-free networks. Two different kinds of scale-free networks, i.e. networks with power law P(k), are considered: 1) scale-free networks with no local clustering produced by the Barabasi-Albert model and 2) scale-free networks ...
متن کاملTolerance of scale-free networks against attack-induced cascades.
Scale-free networks can be disintegrated by attack on a single or a very few nodes through the process of cascading failures. By utilizing a prototype cascading model, we previously determined the critical value of the capacity parameter below which the network can become disintegrated due to attack on a single node. A fundamental question in network security, which has not been addressed previ...
متن کاملEnhancing the Scale-Free Network's Attack Tolerance
Despite the large size of most communication systems such as the Internet and World Wide Web (WWW), there is a relatively short path between two nodes, revealing the networks’ small world characteristic which speeds the delivery of information and data. While these networks have a surprising error tolerance, their scale-free topology makes them fragile under intentional attack, leaving us a cha...
متن کاملError and attack tolerance of layered complex networks.
Many complex systems may be described by not one but a number of complex networks mapped on each other in a multi-layer structure. Because of the interactions and dependencies between these layers, the state of a single layer does not necessarily reflect well the state of the entire system. In this paper we study the robustness of five examples of two-layer complex systems: three real-life data...
متن کاملComparative Resilience Notions and Vertex Attack Tolerance of Scale-Free Networks
We are concerned with an appropriate mathematical measure of resilience in the face of targeted node attacks for arbitrary degree networks, and subsequently comparing the resilience of different scale-free network models with the proposed measure. We strongly motivate our resilience measure termed vertex attack tolerance (VAT), which is denoted mathematically as τ(G) = minS⊂V |S| |V−S−Cmax(V−S)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica A: Statistical Mechanics and its Applications
سال: 2003
ISSN: 0378-4371
DOI: 10.1016/s0378-4371(02)01545-5